Spanning tree congestion of planar graphs
نویسندگان
چکیده
منابع مشابه
Spanning Tree Congestion of Planar Graphs
The paper is devoted to estimates of the spanning tree congestion for some planar graphs. The main results of the paper: (1) We almost determined (up to ±1) the maximal possible spanning tree congestion for planar graphs. (2) The value of congestion indicator introduced in Ostrovskii [Discrete Math. 310 (2010), no. 6–7, 1204–1209] can be very far from the value of the spanning tree congestion. ...
متن کاملSpanning tree congestion critical graphs
The linear or cyclic cutwidth of a graph G is the minimum congestion when G is embedded into either a path or a cycle respectively. A graph is cutwith critical if it is homeomorphically minimal and all of its subgraphs have lower cutwitdth. Our purpose is to extend the study of congestion critical graphs to embeddings on spanning trees.
متن کاملMinimum congestion spanning trees in planar graphs
The main purpose of the paper is to develop an approach to evaluation or estimation of the spanning tree congestion of planar graphs. This approach is used to evaluate the spanning tree congestion of triangular grids.
متن کاملSpanning tree congestion of some product graphs
We estimate spanning tree congestion for cartesian products of paths and complete graphs.
متن کاملOn Spanning Tree Congestion of Product Graphs
In this paper we consider the spanning tree congestion for several families of graphs. We find the exact spanning tree congestion for toroidal meshes, Cm×Cn, and cylindrical meshes, Pm×Cn,. Also we find bounds for the spanning tree congestion of Qn, and a construction that gives the upper bound.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Involve, a Journal of Mathematics
سال: 2014
ISSN: 1944-4184,1944-4176
DOI: 10.2140/involve.2014.7.205